Time-Situated Reasoning within Tight Deadlines and Realistic Space and Computation Bounds
نویسنده
چکیده
We develop an effective representational and inferential framework for fully deadline-coupled, time-situated problem solving. Our effort is to model an agent in a tight and rigid deadline situation, in need of successfully formulating and executing a deadline-feasible plan of action as the world around the agent continues to change. We highlight the severe time-pressure under which the agent must operate with a paradigmatic problem scenario : Nell & Dudley and the railroad tracks. Nell is tied to the railroad tracks as a train approaches. Dudley, our agent, must formulate a plan to save her and carry it out before the oncoming train reaches her. He must deliberate (plan) in order to decide this, yet as he does so, the train draws nearer to Nell.
منابع مشابه
Formal Real-Time Imagination
Formal real-time imagination is a term that may curiously describe the activities of a commonsense agent in a real-time setting in general, and in a tight deadline situation in particular. We brieey describe anàctive-logic' mechanism that ts this description. Temporal projection is an essential component of real-time planning. We draw a parallel between imagination as we understand it in human ...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملTight space-noise tradeoffs in computing the ergodic measure
In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is ε, and the function describing the evolution of the system is not by itself a source of computational complexity, then the density function of the ergodic measure can be approximated within preci...
متن کاملTight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines
We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and processing general or unary inputs. In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case. Memory...
متن کاملUsing Probability to
Soft deadlines are signiicant in systems in which a bound on the response time is important, but the failure to meet the response time is not a disaster. Soft deadlines occur, for example, in telephony and switching networks. We investigate how to put probabilistic bounds on the time-complexity of a concurrent logic program by combining (on-line) prooling with an (oo-line) probabilistic complex...
متن کامل